Bounded Memory, Inertia, Sampling and Weighting Model for Market Entry Games

نویسندگان

  • Wei Chen
  • Shu-Yu Liu
  • Chih-Han Chen
  • Yi-Shan Lee
چکیده

This paper describes the “Bounded Memory, Inertia, Sampling and Weighting” (BI-SAW) model, which won the http://sites.google.com/site/gpredcomp/Market Entry Prediction Competition in 2010. The BI-SAW model refines the I-SAW Model (Erev et al. [1]) by adding the assumption of limited memory span. In particular, we assume when players draw a small sample to weight against the average payoff of all past experience, they can only recall 6 trials of past experience. On the other hand, we keep all other key features of the I-SAW model: (1) Reliance on a small sample of past experiences, (2) Strong inertia and recency effects, and (3) Surprise triggers change. We estimate this model using the first set of experimental results run by the competition organizers, and use it to predict results of a second set of similar experiments later ran by the organizers. We find significant improvement in out-of-sample predictability (against the I-SAW model) in terms of smaller mean normalized MSD, and such result is robust to resampling the predicted game set and reversing the role of the sets of experimental results. Our model’s performance is the best among all the participants.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A Choice Prediction Competition for Market Entry Games: An Introduction

A choice prediction competition is organized that focuses on decisions from experience in market entry games (http://sites.google.com/site/gpredcomp/ and http://www.mdpi.com/si/games/predict-behavior/). The competition is based on two experiments: An estimation experiment, and a competition experiment. The two experiments use the same methods and subject pool, and examine games randomly selecte...

متن کامل

Count-Based Frequency Estimation with Bounded Memory

Count-based estimators are a fundamental building block of a number of powerful sequential prediction algorithms, including Context Tree Weighting and Prediction by Partial Matching. Keeping exact counts, however, typically results in a high memory overhead. In particular, when dealing with large alphabets the memory requirements of count-based estimators often become prohibitive. In this paper...

متن کامل

Estimating Dynamic Games of Complete Information with an Application to the Generic Pharmaceutical Industry

We estimate a dynamic oligopolistic entry model for the generic pharmaceutical industry that allows for dynamic spillovers from experience due to entry on future costs. Ex ante all firms are identical and heterogeneity arises endogenously based on past decisions of firms. Our paper contributes to both the estimation of dynamic games and the understanding of entry decisions in the pharmaceutical...

متن کامل

Reputation and Bounded Memory in Repeated Games with Incomplete Information

Reputation and Bounded Memory in Repeated Games with Incomplete Information Daniel Monte 2007 This dissertation is a study of bounded memory and reputation in games. In the …rst chapter we show that the optimal use of a …nite memory may induce inertia and infrequent updating on a player’s behavior, sometimes for strategic reasons. The setting is a repeated cheap-talk game with incomplete inform...

متن کامل

Investigating the effectiveness of memory-based computer cognitive games in improving working memory and sustained attention of students with learning disability

Abstract Background and aim: Nowadays, exploring strategies to help students with learning disabilities is one of the areas of interest for many psychologists and researchers. The aim of this study was to evaluate the effectiveness of memory-based computer cognitive games in improving working memory and sustained attention of students with learning disabilities in Arak. Method: The method ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • Games

دوره 2  شماره 

صفحات  -

تاریخ انتشار 2011